Type space functors and interpretations in positive logic
نویسندگان
چکیده
We construct a 2-equivalence $\mathfrak{CohTheory}^\text{op} \simeq \mathfrak{TypeSpaceFunc}$. Here $\mathfrak{CohTheory}$ is the 2-category of positive theories and $\mathfrak{TypeSpaceFunc}$ type space functors. give precise definition interpretations for logic, which will be 1-cells in $\mathfrak{CohTheory}$. The 2-cells are definable homomorphisms. restricts to duality categories, making philosophy that theory `the same' as collection its spaces (i.e. functor). In characterising those functors arise functors, we find they specific instances (coherent) hyperdoctrines. This connects two different schools thought on logical structure theory. key ingredient, Deligne completeness theorem, arises from topos theory, where have been studied under name coherent theories.
منابع مشابه
Borel Functors and Infinitary Interpretations
We introduce the notion of infinitary interpretation of structures. In general, an interpretation between structures induces a continuous homomorphism between their automorphism groups, and furthermore, it induces a functor between the categories of copies of each structure. We show that for the case of infinitary interpretation the reversals are also true: Every Baire-measurable homomorphism b...
متن کاملThe Logic of Linear Functors
R. B L U T E†, J. R. B. C O C K E T T‡, and R. A. G. S E E L Y§ † Department of Mathematics and Statistics, University of Ottawa, 585 King Edward St, Ottawa, ON, K1N 6N5, Canada. Email: [email protected] ‡ Department of Computer Science, University of Calgary, 2500 University Drive, Calgary, AL, T2N 1N4, Canada. Email: [email protected] § Department of Mathematics and Statistics, ...
متن کاملCoequational logic for accessible functors
Covarieties of coalgebras are those classes of coalgebras for an endofunctor H on the category of sets that are closed under coproducts, subcoalgebras and quotients. Equivalently, covarieties are classes of H-coalgebras that can be presented by coequations. Adámek introduced a logic of coequations and proved soundness and completeness for all polynomial functors on the category of sets. Here th...
متن کاملCoequational Logic for Finitary Functors
Coequations, which are subsets of a cofree coalgebra, can be viewed as properties of systems. In case of a polynomial functor, a logic of coequations was formulated by J. Adámek. However, the logic is more complicated for other functors than polynomial ones, and simple deduction rules can no longer be formulated. A simpler coequational logic for finitely branching labelled transition systems wa...
متن کاملOn Kolmogorov–Gödel–type Interpretations of Classical Logic
The size of a lambda term’s type assignment is traditionally interpreted as the number of involved typing rules, since that interpretation corresponds to the complexity of underlying logical proof. However, it can be also assessed using some finergrained measures such as the number of involved type declarations, or even as the sum of the sizes of all types in involved type declarations. These q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2022
ISSN: ['1432-0665', '0933-5846']
DOI: https://doi.org/10.1007/s00153-022-00825-7